Two most nondeterministic programs
نویسندگان
چکیده
منابع مشابه
Implementations of Nondeterministic Programs
Non-determinism is widely recognized as a valuable tool for program development [Dijkstra 1976]. It appears also as the natural environment for the , evolution of systems of parallel processes; sequential implementation of such systems through non-deterministically simulating their distributed behaviour can be an effective programming technique [Guerreiro 1981, 1983b]. Furthermore, the concept ...
متن کاملLow-Deterministic Security For Low-Nondeterministic Programs
We present a new algorithm, together with a full soundness proof, which guarantees probabilistic noninterference (PN) for concurrent programs. The algorithm follows the “low-deterministic security” (LSOD) approach, but for the first time allows general low-nondeterminism as long as PN is not violated. The algorithm is based on the earlier observation by Giffhorn and Snelting that low-nondetermi...
متن کاملTermination of Nondeterministic Recursive Probabilistic Programs
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers). Our result also clarifies previous results which claimed that ranking supermartingales are not a complete approach even for nondeter...
متن کاملEvent Manipulation for Nondeterministic Shared-Memory Programs
Building powerful machines is only one part of high performance computing. Obviously, such supercomputers must be programmed e ciently to obtain the desired performance. This task is di cult and time consuming due to huge amounts of data being processed and critical anomalies like deadlocks and race conditions. This paper focuses on race conditions in shared-memory programs, which are introduce...
متن کاملRefinement Calculus, Part I: Sequential Nondeterministic Programs
A lattice theoretic framework for the calculus of program reenement is presented. Speciications and program statements are combined into a single (innnitary) language of commands which permits miraculous, angelic and demonic statements to be used in the description of program behavior. The weakest precondition calculus is extended to cover this larger class of statements and a game-theoretic in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1986
ISSN: 0167-6423
DOI: 10.1016/0167-6423(86)90019-5